Constructing designs using the union method

نویسنده

  • Alan Rahilly
چکیده

Given a design V, other designs can be constructed by using unions of various sets of blocks as new blocks. This method of constructing designs is referred to as "the union method". In general, the constructed design has neither constant blocksize nor balance properties. Various situations in which balanced incomplete block designs (BIBD's) and group divisible designs (GDD's) can be constructed from BIBD's and GDD's using the union method are presented. Generally speaking, it is necessary to assume that the original BIBD or GDD has a "dual property". In the cases where a BIBD V", is constructed, the question as to whether Vu is simple is considered. Simple BIBD's with less than thirty points are constructed for the following six parameter sets for which no such design was previously known: 2-(27, 12, 132), 2-(25, 7,385), 2-(27, 7, 462), 2-(27, 5,60), 2-(21, 6, 15), 2-(28, 8, 14).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

A recursive construction for simple t−designs using resolution

This work presents a recursive construction for simple t-designs using resolutions of the ingredient designs. The result extends a construction of t-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks of a constructed design as a collection of block unions from a number of appropriate pairs of disjoint ingredient designs. Now, if some pairs of these ingredient...

متن کامل

Algorithmic Construction of Efficient Fractional Factorial Designs With Large Run Sizes

Fractional factorial designs are widely used in practice and typically chosen according to the minimum aberration criterion. A sequential algorithm is developed for constructing efficient fractional factorial designs. A construction procedure is proposed that only allows a design to be constructed from its minimum aberration projection in the sequential build-up process. To efficiently identify...

متن کامل

دسترسی بافندگان فرش روستایی به نقشه فرش ابریشمی: مطالعه موردی در شهرستان زنجان

Carpet design and decoration are the fundamental elements for producing carpet and they are important factors determining material and artistic values of a carpet. The access and use of innovative and demand driven designs are the crucial issues that carpet weavers face with, affecting their production, productivity and income. The purpose of this paper is to explore the supply sources and meth...

متن کامل

Using a Novel Concept of Potential Pixel Energy for Object Tracking

Abstract   In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1992